A finite model theorem for the propositional μ-calculus
نویسنده
چکیده
We prove a finite model theorem and infinitary completeness result for the propositional μ-calculus. The construction establishes a link between finite model theorems for propositional program logics and the theory of wellquasi-orders.
منابع مشابه
Canonical completeness of infinitary μ
This paper presents a new model construction for a natural cut-free infinitary version Kω (μ) of the propositional modal μ-calculus. Based on that the completeness of Kω (μ) and the related system Kω(μ) can be established directly – no detour, for example through automata theory, is needed. As a side result we also obtain a finite, cut-free sound and complete system for the propositional modal ...
متن کاملReview of : Model Checking by Edmund
The goal of model checking is to determine if a given property holds in a particular system. For example, we may want to know that a server never sends sensitive data to the wrong client. Model checking has been used effectively in practice for many finite-state systems, including real-time applications, and for some infinite families of finite systems. Theorem proving and testing are other app...
متن کاملPolynomial Approximations for Model Checking
The μ-Calculus of D.Kozen (1983) is a very powerful propositional program logic with fixpoints. It is widely used for specification and verification. Model checking is a very popular automatic approach for verification of specifications of finite state systems. The most efficient algorithms that have been developed so far for model checking the μ-Calculus in finite state systems have exponentia...
متن کاملAn Automata Theoretic Decision Procedure for the Propositional Mu-Calculus
The propositional mu-calculus is a propositional logic of programs which incorporates a least fixpoint operator and subsumes the propositional dynamic logic of Fischer and Ladner, the infinite looping construct of Streett, and the game logic of Parikh. We give an elementary time decision procedure, using a reduction to the emptiness problem for automata on infinite trees. A small model theorem ...
متن کاملModal Fixpoint Logics
Context. Modal fixpoint logics constitute a research field of considerable interest, not only because of its many applications in computer science, but also because of its rich mathematical theory, which features deep connections with fields as diverse as lattice theory, automata theory, and universal coalgebra. In the 1970s computer scientists started to use modal logics as specification langu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 47 شماره
صفحات -
تاریخ انتشار 1988